Decidability problems for unary output sequential transducers
نویسندگان
چکیده
منابع مشابه
Input- or output-unary sweeping transducers are weaker than their 2-way counterparts
In a previous paper we showed that two-way (nondeterministic) transducers with unary input and output alphabets have the same recognition power as the sweeping ones. We show that this no longer holds when one of the alphabets has cardinality at least 2. Mathematics Subject Classification. 68Q70.
متن کاملDecidable Problems for Unary PFAs
Given a PFA A and a cut-point λ, the isolation problem asks if there is a bound > 0 such that the acceptance probability of every word is bounded away from λ by . In this paper we show that the isolation problem for PFAs with a unary input alphabet is (a) coNPcomplete, if the cut-point is 0 or 1, and (b) is in coNP and coNP-hard, if the cut-point is in (0, 1). We also show that the language con...
متن کاملMinimization algorithms for sequential transducers
We present general algorithms for minimizing sequential nite-state transducers that output strings or numbers. The algorithms are shown to be e cient since in the case of acyclic transducers and for output strings they operate in O(S + |E|+ |V |+ (|E| − |V |+ |F |) · (|Pmax|+ 1)) steps, where S is the sum of the lengths of all output labels of the resulting transducer, E the set of transitions ...
متن کاملOn the Decidability of Bounded Valuedness for Transducers
We give a new and conceptually different proof for the decidability of k-valuedness of transducers (a result due to Gurari and Ibarra), without resorting to any other kind of machines than transducers. In contrast with the previous proof, our algorithm takes into account the structure of the analysed transducers and yields better complexity bounds. With the same techniques, we also present a ne...
متن کاملDecidability Problems for Actor Systems
We introduce a nominal actor-based language and study its expressive power. We have identified the presence/absence of fields as a relevant feature: the dynamic creation of names in combination with fields gives rise to Turing completeness. On the other hand, restricting to stateless actors gives rise to systems for which properties such as termination are decidable. Such decidability result ho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1991
ISSN: 0166-218X
DOI: 10.1016/0166-218x(91)90096-f